Partition statistics on permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Directional Statistics on Permutations

Distributions over permutations arise in applications ranging from multi-object tracking to ranking. The difficulty in dealing with these distributions is caused by the size of their domain, which is factorial in the number of entities (n!). The direct definition of a multinomial distribution over the permutation space is impractical for all but a very small n. In this work we propose an embedd...

متن کامل

Statistics on Permutations

Let π = π1π2 · · · πn be any permutation of length n, we say a descent πiπi+1 is a lower, middle, upper if there exists j > i + 1 such that πj < πi+1, πi+1 < πj < πi, πi < πj, respectively. Similarly, we say a rise πiπi+1 is a lower, middle, upper if there exists j > i + 1 such that πj < πi, πi < πj < πi+1, πi+1 < πj, respectively. In this paper we give an explicit formula for the generating fu...

متن کامل

Statistics on Pattern-avoiding Permutations

This thesis concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics ‘number of fixed points’ and ‘number of excedances’ is the same in 321-avoiding as in 132-avoiding permutations. This generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, ...

متن کامل

Refined Inversion Statistics on Permutations

We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the non-inversions of a permutation). We also provide a distribution function for non-inversion sums, a distribution function for k-step inversions that relates to...

متن کامل

Combinatorial Statistics on Alternating Permutations

We consider two combinatorial statistics on permutations. One is the genus. The other, d̂es, is defined for alternating permutations, as the sum of the number of descents in the subwords formed by the peaks and the valleys. We investigate the distribution of d̂es on genus zero permutations and Baxter permutations. Our qenumerative results relate the d̂es statistic to lattice path enumeration, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1992

ISSN: 0012-365X

DOI: 10.1016/0012-365x(92)90366-n